//
// Created by cheng on 2021/02/25.
//

#include "BiTree.h"

using namespace std;

int main () {
    int i;
    BinaryTree tree = nullptr;
    cin >> i;
    while (i != -1) {
        insert(i, tree);
        cin >> i;
    }
    auto flag = Find(25, tree);
    flag ? cout << "yes" : cout << "no";
    cout << endl;
    PreOrder_Recursion(tree);
    cout << endl;
    InOrder_Recursion(tree);
    cout << endl;
}